Low Latency Synchronization Through Speculation
نویسندگان
چکیده
Synchronization between independently clocked regions in a high performance system is often subject to latencies of more than one clock cycle. We show how the latency can be reduced significantly, typically to half the number of clock cycles required for high reliability, by speculating that a long synchronization time is not required. The small number of synchronization metastability times longer than normal are detected, and subsequent computations re-evaluated, thus maintaining the reliability of the system.
منابع مشابه
A Novel Low Latency, High Resolution and Low Cost Time Synchronization
This report presents a new low latency, high resolution and low cost timing synchronization technique for digital receivers. Traditional timing synchronization employs Matched filter to perform cross-correlation operation and estimate Time-of-Arrival (TOA) of the signal. Decreasing the latency of the traditional method through oversampling leads to a higher complexity and it is not viable. Furt...
متن کاملAvoid Synchronization Latency Using Vlsi Implementation
The phenomenon of metastability is inherent in clocked digital logic. Many techniques have been presented for minimizing metastability, both for crossing clock domains, and for handling asynchronous inputs. Flip-flops are among these systems and can take an unbounded amount of time to decide which logic state to settle to once they become metastable. This problematic behavior is often prevented...
متن کاملLow-Latency Interaction through Choice-Points, Buffering, and Cuts in Tactus
Multimedia streams usually require prefetching and buffering to ens’ure steady, glitch-fnee d e h e r y to audio and video displays, but buffering ca’uses undesirable latency. This latency may be manifested as startup delays, glitches, dropouts, and loss of synchronization. I n interactive media presentations .where there are a small number of choices, alternative streams can be prefetched to r...
متن کاملTolerating Latency in Replicated State Machines Through Client Speculation
Replicated state machines are an important and widelystudied methodology for tolerating a wide range of faults. Unfortunately, while replicas should be distributed geographically for maximum fault tolerance, current replicated state machine protocols tend to magnify the effects of high network latencies caused by geographic distribution. In this paper, we examine how to use speculative executio...
متن کاملChip Multiprocessors with Implicit Transactions
Chip Multiprocessors (CMPs) are an efficient way of designing and use the huge amount of transistors on a chip. Different cores on a chip can compose a shared memory system with a very low-latency interconnect at a very low cost. Unfortunately, consistency models and synchronization styles of popular programming models for multiprocessors impose severe performance losses. Known architectural ap...
متن کامل